A Curvature-based Manifold Learning Algorithm
نویسندگان
چکیده
Manifold learning aims to find a low dimensional parameterization for data sets which lie on nonlinear manifolds in a high-dimensional space. Applications of manifold learning include face recognition, image retrieval, machine learning, classification, visualization, and so on. By studying the existing manifold learning algorithms and geometric properties of local tangent space of a manifold, we propose an adaptive curvature-based manifold learning algorithm (CBML). With the algorithm, noises and the samples that do not belong to the neighborhood can be detected by computing the deflection between centralized samples and its local tangent space. It can not only be used to select adaptive neighborhood, but also take full advantage of information of neighbors. The algorithm can also be applied to manifold learning with local high curvature. Experiments show that the proposed algorithm in this paper is effective.
منابع مشابه
On the Curvature of Pattern Transformation Manifolds: Numerical Estimation and Applications
This paper addresses the numerical estimation of the principal curvature of pattern transformation manifolds. When a visual pattern undergoes a geometric transformation, it forms a (sub)manifold in the ambient space, which is usually called the transformation manifold. The manifold curvature is an important property characterizing the manifold geometry, with several applications in manifold lea...
متن کاملCurvature-aware Manifold Learning
Traditional manifold learning algorithms assumed that the embedded manifold is globally or locally isometric to Euclidean space. Under this assumption, they divided manifold into a set of overlapping local patches which are locally isometric to linear subsets of Euclidean space. By analyzing the global or local isometry assumptions it can be shown that the learnt manifold is a flat manifold wit...
متن کاملAdaptive Neighboring Selection Algorithm Based on Curvature Prediction in Manifold Learning
Recently manifold learning algorithm for dimensionality reduction attracts more and more interests, and various linear and nonlinear, global and local algorithms are proposed. The key step of manifold learning algorithm is the neighboring region selection. However, so far for the references we know, few of which propose a generally accepted algorithm to well select the neighboring region. So in...
متن کاملDiscovering Shared Structure in Manifold Learning
We claim and present arguments to the effect that a large class of manifold learning algorithms that are essentially local will suffer from at least four generic problems associated with (1) noise in the data, (2) curvature of the manifold, (3) dimensionality of the manifold, and (4) the presence of many manifolds with little data per manifold. This analysis suggests non-local manifold learning...
متن کاملApplying Ricci Flow to High Dimensional Manifold Learning
Traditional manifold learning algorithms often bear an assumption that the local neighborhood of any point on embedded manifold is roughly equal to the tangent space at that point without considering the curvature. The curvature indifferent way of manifold processing often makes traditional dimension reduction poorly neighborhood preserving. To overcome this drawback we propose a new algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JNW
دوره 9 شماره
صفحات -
تاریخ انتشار 2014